23A - You're Given a String - CodeForces Solution

brute force greedy *1200

Please click on ads to support us..

Python Code: 

def solve():
    s = input()
    ans = 0
    i = 0
    j = i+1
    for l in range(len(s), 0, -1):         i = 0
        j = i+1
        while i+l <= len(s):
            j=i+1
            while j+l <= len(s):
                if s[i:i+l] == s[j:j+l]:
                    print(l)
                    return
                j += 1
            i += 1
    print(0)

solve()

C++ Code: 

#include<bits/stdc++.h>
using namespace std;

int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);
string s;
cin>>s;
int ans = 0;
for(int i = 0 ; i<s.size();i++)
{
for(int j=i+1 ; j<s.size();j++)
{
        if(s[i]==s[j]){
            int cnt=1;
        while(j+cnt<s.size() && s[i+cnt]==s[j+cnt]) cnt++;
        if(cnt >ans)ans =cnt;
        }
}
}

cout<<ans;
    return 0;
}


Comments

Submit
0 Comments
More Questions

e-maze-in
Bricks Game
Char Sum
Two Strings
Anagrams
Prime Number
Lexical Sorting Reloaded
1514A - Perfectly Imperfect Array
580A- Kefa and First Steps
1472B- Fair Division
996A - Hit the Lottery
MSNSADM1 Football
MATCHES Playing with Matches
HRDSEQ Hard Sequence
DRCHEF Doctor Chef
559. Maximum Depth of N-ary Tree
821. Shortest Distance to a Character
1441. Build an Array With Stack Operations
1356. Sort Integers by The Number of 1 Bits
922. Sort Array By Parity II
344. Reverse String
1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array
852. Peak Index in a Mountain Array
461. Hamming Distance
1748. Sum of Unique Elements
897. Increasing Order Search Tree
905. Sort Array By Parity
1351. Count Negative Numbers in a Sorted Matrix
617. Merge Two Binary Trees